On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
نویسندگان
چکیده
منابع مشابه
Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. This paper shows that for voters who follow the most central political-science model of electorates— single-peaked preferences—those hardness protections vanish. By using single-peaked preferences to simplify combinatorial coverin...
متن کاملOn Algorithms for $L$-bounded Cut Problem
Given a graph G = (V,E) with two distinguished vertices s, t ∈ V and an integer parameter L > 0, an L-bounded cut is a subset F of edges (nodes) such that the every path between s and t in G \ F has length more than L. The task is to find an L-bounded cut of minimum cardinality. Though the problem is very simple to state and has been studied since the beginning of the 70’s, it is not much under...
متن کاملCombinatorial Continuous Maximum Flow
Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of maxflow defined on a graph...
متن کاملA Maximum Principle for Combinatorial Yamabe Flow
In his proof of Andreev’s theorem, Thurston in [1] introduced a conformal geometric structure on two dimensional simplicial complexes which is an analogue of a Riemannian metric. He then used a version of curvature to prove the existence of circle-packings (see also Marden-Rodin [2] for more exposition). Techniques very similar to elliptic partial differential equation techniques were used by Y...
متن کاملA survey of combinatorial maximum flow algorithms on a network with gains
Network optimization experienced a fast development, during the last few decades. While a traditional network assumes that each flow is conserved on every arc, a flow along an arc may increase or decrease by a fixed factor during its traversal of that arc in a generalized network. This paper surveys combinatorial maximum flow algorithms on the generalized network and compares algorithms for tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2020
ISSN: 1526-1719
DOI: 10.7155/jgaa.00534